Efficient module learning with errors?based post?quantum password?authenticated key exchange
نویسندگان
چکیده
Password-authenticated key exchange (PAKE) is a cryptographic primitive that can establish secure remote communications between the client and server, especially with advantage of amplifying memorable passwords into strong session keys. However, arrival quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post-quantum scheme becomes open research question. In this paper, authors construct quantum-safe protocol, which horizontal extension password-authenticated (PAK) protocol in field module lattices. Subsequently, accompany proposed rigorous security proof random oracle model two adaptions: applying CDF-Zipf characterise ability adversary using pairing errors assumption simplify proof. Taking flexibility learning (MLWE) problem, elaborately select three parameter sets meet different application scenarios. Specifically, authors’ Recommended-PAKE implementation achieves 177-bit generous margin cope later improvement cryptanalysis. The performance results indicate MLWE-PAKE quite practical: compared latest Yang-PAK, Recommended-PAK reduces communication cost running time by 36.8% 13.8%, respectively.
منابع مشابه
Efficient Authenticators with Application to Key Exchange
The notion of authenticator, proposed by Bellare et al., is to transform a protocol secure in the authenticated-link model to a new one secure in the unauthenticated-link model. This notion admits a modular design and analysis of cryptographic protocols and thus greatly simplifies the underlying tasks. However, all previous authenticators are constructed via a so called MT-authenticator. This k...
متن کاملEfficient Key Exchange with Tight Security Reduction
In this paper, we propose two authenticated key exchange (AKE) protocols, SMEN and SMEN−, which have efficient online computation and tight security proof in the extended Canetti-Krawczyk (eCK) model. SMEN takes 1.25 exponentiations in online computation, close to that (1.17 exponentiations) of the most efficient AKEs MQV and its variants HMQV and CMQV. SMEN has a security reduction as tight as...
متن کاملModule-LWE key exchange and encryption: The three bears
We propose a new post-quantum key exchange algorithm based on the module learning with errors (mLWE) problem. Our ThreeBears algorithm is simple and performant, but our main goal is to suggest mLWE over a generalized Mersenne field instead of a polynomial ring. We also show how to build a public-key encryption system from the key exchange algorithm.
متن کاملAn Efficient Authenticated Asymmetric Key Exchange Scheme
In this paper, an efficient authenticated asymmetric key exchange scheme has been designed based on the features of the Threshold Cryptography [11]. The method provides authentication and key establishment (like RSA, ) over an insecure channel using shares of two prime numbers and is secure against even off-line dictionary attack. In the proposed scheme, , and are all secret and each of the two...
متن کاملPassword-authenticated Key Exchange using Efficient MACs
This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way of choosing a password that achieves an optimum trade-off between usability and security. Indeed, passwords belonging to a highly structured language are essentially equivalent to low entropy strings. A fundamental goal is that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iet Information Security
سال: 2022
ISSN: ['1751-8709', '1751-8717']
DOI: https://doi.org/10.1049/ise2.12094